Two words  in the set <i>W</i>(<i>S</i>) are equivalent if one can be obtained from the other  by a finite sequence of insertions or deletions of the form
 <i>xx<sup>-1</sup></i> or 
 <i>x<sup>-1</sup>x</i>, where <i> x &#8712 S</i>.